Designing temporal networks that synchronize under resource constraints

نویسندگان

چکیده

Abstract Being fundamentally a non-equilibrium process, synchronization comes with unavoidable energy costs and has to be maintained under the constraint of limited resources. Such resource constraints are often reflected as finite coupling budget available in network facilitate interaction communication. Here, we show that introducing temporal variation structure can lead efficient even when stable synchrony is impossible any static given budget, thereby demonstrating fundamental advantage networks. The networks generated by our open-loop design versatile sense promoting for systems vastly different dynamics, including periodic chaotic dynamics both discrete-time continuous-time models. Furthermore, link dynamic stabilization effect changing topology curvature master stability function, which provides analytical insights into on general. In particular, results shed light switching rate explain why certain synchronize only intermediate rate.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Temporal Vaccination Games under Resource Constraints

The decision to take vaccinations and other protective interventions for avoiding an infection is a natural game-theoretic setting. Most of the work on vaccination games has focused on decisions at the start of an epidemic. However, a lot of people defer their vaccination decisions, in practice. For example, in the case of the seasonal flu, vaccination rates gradually increase, as the epidemic ...

متن کامل

Coverage-maximization in networks under resource constraints.

Efficient coverage algorithms are essential for information search or dispersal in all kinds of networks. We define an extended coverage problem which accounts for constrained resources of consumed bandwidth B and time T . Our solution to the network challenge is here studied for regular grids only. Using methods from statistical mechanics, we develop a coverage algorithm with proliferating mes...

متن کامل

Learning classifiers that perform probabilistic classification under computational resource constraints

Existing online machine learning techniques are often tuned to minimized computational resources, and are not able to utilize further resources when they are available. This is likely to result in sub-optimal learning performance in many online applications where the computational resources available will vary from time to time. This paper analyzes categories of computational resources and defi...

متن کامل

Planning under Resource Constraints

This paper outlines the basic principles underlying reasoning about resources in IPP, which is a classical planner based on planning graphs originally introduced with the graphplan system. The main idea is to deal with resources in a strictly action-centered way, i.e., one speciies how each action consumes or produces resources, but no explicit temporal model is used. This avoids the computatio...

متن کامل

Topic-Based Influence Computation in Social Networks under Resource Constraints

As social networks are constantly changing and evolving, methods to analyze dynamic social networks are becoming more important in understanding social trends. However, due to the restrictions imposed by the social network service providers, the resources available to fetch the entire contents of a social network are typically very limited. As a result, analysis of dynamic social network data r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature Communications

سال: 2021

ISSN: ['2041-1723']

DOI: https://doi.org/10.1038/s41467-021-23446-9